Essential Localizations and Infinitary Exact Completion
نویسنده
چکیده
We prove the universal property of the infinitary exact completion of a category with weak small limits. As an application, we slightly weaken the conditions characterizing essential localizations of varieties (in particular, of module categories) and of presheaf categories. Introduction An essential localization is a reflective subcategory such that the reflector has a left adjoint. In [12], Roos gave an abstract characterization of essential localizations of module categories, proving that they are those complete and cocomplete abelian categories with a regular generator, satisfying the following conditions (we write the conditions in a nonabelian style, more convenient for the general framework of this work) (AB4*) Regular epimorphisms are product-stable ; (AB5) Filtered colimits are exact, i.e. commute with finite limits ; (AB6) Given a small family of functors (Hi : Ai → A)I defined on small filtered categories, the canonical comparison τ is an isomorphism τ : colim( ∏
منابع مشابه
A Note on the Exact Completion of a Regular Category, and Its Infinitary Generalizations
A new description of the exact completion Cex/reg of a regular category C is given, using a certain topos Shv(C) of sheaves on C; the exact completion is then constructed as the closure of C in Shv(C) under finite limits and coequalizers of equivalence relations. An infinitary generalization is proved, and the classical description of the exact completion is derived.
متن کاملStrict Ideal Completions of the Lambda Calculus
We present a family of infinitary lambda calculi with varying strictness. This family of calculi corresponds to the infinitary lambda calculi of Kennaway et al. but instead of metric completion our calculi are based on ideal completion. We show that each of our calculi conservatively extends the corresponding metric-based calculus. The extension that our calculi provide is characterised in the ...
متن کاملConvergence in Infinitary Term Graph Rewriting Systems is Simple
Term graph rewriting provides a formalism for implementing term rewriting in an efficient manner by avoiding duplication. Infinitary term rewriting has been introduced to study infinite term reduction sequences. Such infinite reductions can be used to model non-strict evaluation. In this paper, we unify term graph rewriting and infinitary term rewriting thereby addressing both components of laz...
متن کاملA Note on Free Regular and Exact Completions and Their Infinitary Generalizations
Free regular and exact completions of categories with various ranks of weak limits are presented as subcategories of presheaf categories. Their universal properties can then be derived with standard techniques as used in duality theory.
متن کاملA New Lower Bound for Completion Time Distribution Function of Stochastic PERT Networks
In this paper, a new method for developing a lower bound on exact completion time distribution function of stochastic PERT networks is provided that is based on simplifying the structure of this type of network. The designed mechanism simplifies network structure by arc duplication so that network distribution function can be calculated only with convolution and multiplication. The selection of...
متن کامل